The gray prediction search algorithm for block motion estimation

نویسندگان

  • Jer-Min Jou
  • Pei-Yin Chen
  • Jian-Ming Sun
چکیده

Due to the temporal and spatial correlation of the image sequence, the motion vector of a block is highly related to the motion vectors of its adjacent blocks in the same image frame. If we can obtain useful and enough information from the adjacent motion vectors, the total number of search points used to find the motion vector of the block may be reduced significantly. Using that idea, an efficient gray prediction search (GPS) algorithm for block motion estimation is proposed in this paper. Based on the gray system theory, the GPS can determine the motion vectors of image blocks quickly and correctly. The experimental results show that the proposed algorithm performs better than other search algorithms, such as 3SS, CS, PHODS, 4SS, BBGDS, SES, and PSA, in terms of six different measures: 1) average mean square error per pixel; 2) average peak signal-to-noise ratio; 3) average prediction errors per pixel; 4) average entropy of prediction errors; 5) average percentage of unpredictable pels per frame; and 6) average search points per block.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive search area for fast motion estimation

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...

متن کامل

Simplified Block Matching Algorithm for Fast Motion Estimation in Video Compression

Block matching motion estimation was one of the most important modules in the design of any video encoder. It consumed more than 85% of video encoding time due to searching of a candidate block in the search window of the reference frame. To minimize the search time on block matching, a simplified and efficient Block Matching Algorithm for Fast Motion Estimation was proposed. It had two steps s...

متن کامل

Adaptive Motion Search Based on Block Difference and Motion Magnitude

In this paper, we derive optimal search patterns for fast block matching motion estimation. Since the motion search pattern is important in terms of search speed and correctness of the motion information, we consider various search patterns and search strategies. By analyzing the block matching algorithm as a function of the block size and distance in the search area, we find analytic search pa...

متن کامل

Adaptive search area for fast motion estimation

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of regular...

متن کامل

Fast Motion Estimation with Search Center Prediction

This paper presents a new block based motion estimation algorithm that employs motion vector prediction to locate an initial search point, which is called a search center, and an outward spiral search pattern with motion vector refinement, to speed up the motion estimation process. It is found that the proposed algorithm is only slightly slower than Cross Search (CS), but has PSNR very close to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Circuits Syst. Video Techn.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1999